Self-Corrected Belief-Propagation Decoder for Source Coding With Unknown Source Statistics
نویسندگان
چکیده
This letter describes a practical Slepian-Wolf source coding scheme based on Low Density Parity Check (LDPC) codes. It considers the realistic setup where parameters of statistical model between and side information are unknown. A novel Self-Corrected Belief-Propagation (SC-BP) algorithm is proposed in order to make robust incorrect by introducing some memory inside LDPC decoder. Two Dimensional Evolution (2D-DE) analysis then developed predict theoretical performance SC-BP Both 2D-DE Monte-Carlo simulations confirm robustness The solution allows for an important complexity reduction shows very close existing methods which jointly estimate sequence.
منابع مشابه
Source Coding with Decoder Side Information
In this report, we study source coding problems with decoder side information (SI). Source coding problems with decoder side information are a special case of distributed source coding problems. We outline the relation between various distributed source coding problems in Table 1 with the help of Figure 1. For reference, we also include the standard single-source lossless and lossy compression ...
متن کاملLoop Corrected Belief Propagation
We propose a method for improving Belief Propagation (BP) that takes into account the influence of loops in the graphical model. The method is a variation on and generalization of the method recently introduced by Montanari and Rizzo [2005]. It consists of two steps: (i) standard BP is used to calculate cavity distributions for each variable (i.e. probability distributions on the Markov blanket...
متن کاملSource Coding with Causal Side Information at the Decoder
2 ⌋ }. The i-th reconstruction is of the form X̂i(T, Y ), i.e., it is allowed to depend on the side information, but only causally. The motivation for studying this problem comes from source coding systems that are constrained to operate with no, or with limited, delay. Sequential source codes with a limited-delay encoder and a sequential, zero-delay, decoder with access to side information comp...
متن کاملOn zero-error source coding with decoder side information
Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution ( ). The following source coding problem is considered: the encoder knows , while the decoder knows and wants to learn without error. The minimum zero-error asymptotic rate of transmission is shown to be the complementary graph entropy of an associated graph. Thus, previous result...
متن کاملSparse Source Separation with Unknown Source Number
Sparse Blind Source Separation (BSS) problems have recently received some attention. And some of them have been proposed for the unknown number of sources. However, they only consider the overdetermined case (i.e. with more sources than sensors). In the practical BSS, there are not prior assumptions on the number of sources. In this paper, we use cluster and Principal Component Analysis (PCA) t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2021
ISSN: ['1558-2558', '1089-7798', '2373-7891']
DOI: https://doi.org/10.1109/lcomm.2021.3075110